SR: A Cross-Layer Routing in Wireless Ad Hoc Sensor Networks

In this paper, we extend our early work on safety information in wireless ad hoc sensor networks to the realistic communication model in which each node has the opportunity to receive the signal from any node in the entire network. The safety information is a value ∈ [0, 1] at each node which is calculated in a fully distributed manner based on 1-hop neighborhood information. It indicates the maximum probability of a successful straightforward path from this node to a destination along the edge of the networks. Such information can be used to mitigate the impact of local minima and achieve more straightforward paths in the geographic greedy forwarding. The whole construction process can converge quickly and be controlled in a limited area. By integrating with the MAC protocols, its cost can be minimized. Both analytical and experimental results illustrate that our new approach is cost-effective, compared with the best results known to date.